Path-Moose: A Scalable All-Path Bridging Protocol

Path-Moose: A Scalable All-Path Bridging Protocol

wARP-Path: Implications of adapting the Ethernet-based ARP-Path bridging protocol to a wireless environment

The ARP-Path protocol has flourished as a promise for wired networks, creating shortest paths with the simplicity of pure bridging and competing directly with TRILL and SPB. After analyzing different alternatives of ARP-Path and creating the All-Path family, the idea of migrating the protocol to wireless networks appeared to be a good alternative to protocols such as a AODV. In this article, we...

All-Path bridging: Path exploration protocols for data center and campus networks

Today, link-state routing protocols that compute multiple shortest paths predominate in data center and campus networks, where routing is performed either in layer three or in layer two using link-state routing protocols. But current proposals based on link-state routing do not adapt well to real time tra c variations and become very complex when attempting to balance the tra c load. We propose...

Energy Efficient Multi Path Routing Protocol in Internet of Things

Internet of things (IoT) is a network with a wide range of smart and physical objects and gadgets that can exchange information with each other. IOT introduces a variety of services that human life is dependent on its secure and accessible activities. These networks face numerous problems in terms of energy consumption and reliable communication to send the correct data. Moreover, the character...

All-Path Reachability Logic

This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g. concurrent) languages, referred to as all-path reachability logic. It derives partial-correctness properties with all-path semantics (a state satisfying a given precondition reaches states satisfying a given postcondition on all terminating execution paths). The pro...